Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times

A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption

Integrative Cooperative Approach for Solving Permutation Flowshop Scheduling Problem with Sequence Dependent Family Setup Times

This paper addresses to the permutation flowline manufacturing cell with sequence dependent family setup times problem. The objective is to minimize the makespan criterion. We propose a cooperative approach including a genetic algorithm and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorithm in order to enhance the current solution. Moreover, the ap...

A Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times

 We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...

an assembly flow-shop scheduling problem with sequence-dependent setup and transportation times

in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

Metaheuristics for Solving a Hybrid Flexible Flowshop Problem with Sequence-Dependent Setup Times

In this paper, we propose three new metaheuristic implementations to address the problem of minimizing the makespan in a hybrid flexible flowshop with sequence-dependent setup times. The first metaheuristic is a genetic algorithm (GA) embedding two new crossover operators, and the second is an ant colony optimization (ACO) algorithm which incorporates a transition rule featuring lookahead infor...